Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Minimal distance")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Origin

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 1027

  • Page / 42
Export

Selection :

  • and

Turbo codes with modified Welch-Costas interleaversTRIFINA, Lucian; MUNTEANU, Valeriu; TARNICERIU, Daniela et al.Annales des télécommunications. 2007, Vol 62, Num 9-10, pp 1045-1052, issn 0003-4347, 8 p.Article

Measurement of overhead line electrical clearances of importance to the safety of personsSPARROW, L. J; BLACKETT, J. J; JOHNSTONE, C. R et al.IEE conference publication. 1999, pp 3.51.S7-3.54.S7, issn 0537-9989, isbn 0-85296-719-5Conference Paper

On the minimum distance of cyclic codesVAN LINT, J. H; WILSON, R. M.IEEE transactions on information theory. 1986, Vol 32, Num 1, pp 23-40, issn 0018-9448Article

Extremal self-dual codes from symmetric designsSPENCE, E; TONCHEV, V. D.Discrete mathematics. 1992, Vol 110, Num 1-3, pp 265-268, issn 0012-365XArticle

Upper bounds on the minimum distance of trellis codesCALDERBANK, A. R; MAZO, J. E; SHAPIRO, H. M et al.The Bell System technical journal. 1983, Vol 62, Num 8, pp 2617-2646, issn 0005-8580Article

Double circulant quadratic residue codesHELLESETH, Tor; VOLOCH, José Felipe.IEEE transactions on information theory. 2004, Vol 50, Num 9, pp 2154-2155, issn 0018-9448, 2 p.Article

Short-cycle-free interleaver design for increasing minimum squared euclidean distanceHOWARD, Sheryl L; ZEINODDIN, Siavash S; SCHLEGEL, Christian et al.IEEE International Symposium on Information Theory. 2004, isbn 0-7803-8280-3, 1Vol, p. 54Conference Paper

Duadic codesSMID, M. H. M.IEEE transactions on information theory. 1987, Vol 33, Num 3, pp 432-433, issn 0018-9448Article

Minimum distance of logarithmic and fractional partial n-sequencesKUMAR, P. V; WEI, V. K.IEEE transactions on information theory. 1992, Vol 38, Num 5, pp 1474-1482, issn 0018-9448Article

An optimal algorithm for computing the minimum vertex distance between two crossing convex polygonsTOUSSAINT, G. T.Computing (Wien. Print). 1984, Vol 32, Num 4, pp 357-364, issn 0010-485XArticle

The order bound on the minimum distance of the one-point codes associated to the garcia-stichtenoth towerBRAS-AMOROS, Maria; O'SULLIVAN, Michael E.IEEE transactions on information theory. 2007, Vol 53, Num 11, pp 4241-4245, issn 0018-9448, 5 p.Article

Maximum transfer distance between partitionsCHARON, Irène; DENOEUD, Lucile; GUENOCHE, Alain et al.Journal of classification. 2006, Vol 23, Num 1, pp 103-121, issn 0176-4268, 19 p.Article

ON THE MINIMUM DISTANCE OF SOME BCH CODESCOHEN G.1980; IEEE TRANS. INF. THEORY; ISSN 0018-9448; USA; DA. 1980; VOL. 26; NO 3; PP. 363; BIBL. 5 REF.Article

Consistent estimation for some nonlinear errors-in-variables modelsCHENG HSIAO.Journal of econometrics. 1989, Vol 41, Num 1, pp 159-185, issn 0304-4076, 27 p.Article

Channel coding with quadrature-quadrature phase shift-keying (Q2PSK) signalsSAHA, D.IEEE transactions on automatic control. 1990, Vol 38, Num 4, pp 409-417, issn 0018-9286, 9 p.Article

ON A METHOD FOR ESTABLISHING THE MINIMUM DISTANCE OF ABELIAN CODESPETHO A; REMENYI G.1982; PROBL. CONTROL INF. THEORY; ISSN 0370-2529; HUN; DA. 1982; VOL. 11; NO 2; PP. 97-105; ABS. RUS; BIBL. 5 REF.Article

GENERALIZED MINIMUM DISTANCE DECODING ON MAJORITY LOGIC DECODABLE CODESTAI YANG HWANG; SHENG UEI GUAN.1982; IEEE TRANS. INF. THEORY; ISSN 0018-9448; USA; DA. 1982; VOL. 28; NO 5; PART. 1; PP. 790-792; BIBL. 9 REF.Article

A Generalized Construction and Improvements on Nonbinary Codes From Goppa CodesTOMLINSON, Martin; JIBRIL, Mubarak; CEN TJHAI et al.IEEE transactions on information theory. 2013, Vol 59, Num 11, pp 7299-7304, issn 0018-9448, 6 p.Article

An elementary construction of codes from the groups of units of residue rings of polynomialsREID, Les; WICKHAM, Cameron.IEEE transactions on information theory. 2005, Vol 51, Num 1, pp 419-420, issn 0018-9448, 2 p.Article

Nombre maximum d'ordres de slater des tournois T vérifiant σ(T) = 1 = Maximum number of Slater orders of tournaments T with σ(T) = 1HUDRY, O.Mathématiques, informatique et sciences humaines. 1997, Num 140, pp 51-58, issn 0995-2314Article

A fast algorithm for distance calculation between convex objects using the optimization approachZEGHLOUL, S; RAMBEAUD, P.Robotica (Cambridge. Print). 1996, Vol 14, pp 355-363, issn 0263-5747, 4Article

Trellis coding with multidimensional QAM signal setsPIETROBON, S. S; COSTELLO, D. J.IEEE transactions on information theory. 1993, Vol 39, Num 2, pp 325-336, issn 0018-9448Article

Linear codes with covering radius 2 and other new covering codesGABIDULIN, E. M; DAVYDOV, A. A; TOMBAK, L. M et al.IEEE transactions on information theory. 1991, Vol 37, Num 1, pp 219-224, issn 0018-9448, 6 p.Article

The parameters of projective Reed-Müller codesLACHAUD, G.Discrete mathematics. 1990, Vol 81, Num 2, pp 217-221, issn 0012-365X, 5 p.Article

Weight Distribution and List-Decoding Size of Reed―Muller CodesKAUFMAN, Tali; LOVETT, Shachar; PORAT, Ely et al.IEEE transactions on information theory. 2012, Vol 58, Num 5, pp 2689-2696, issn 0018-9448, 8 p.Article

  • Page / 42